Elliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth’s Algorithm
نویسندگان
چکیده
منابع مشابه
Elliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth’s Algorithm
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication, which is performed in the topmost level of GF multiplication and GF division, has been the double-and-add algorithm, which is being recently challenged by NAF (Non-Adjacent Format) algorithm. In this paper, we propose a more e...
متن کاملElliptic Curve Point Multiplication Algorithm Using Precomputation
Window-based elliptic curve multiplication algorithms are more attractive than non-window techniques if precomputation is allowed. Reducing the complexity of elliptic curve point multiplication of the form , which is the dominant operation in elliptic curve cryptography schemes, will reduces the overall complexity of the cryptographic protocol. The wBD is a new window-based elliptic curve multi...
متن کاملElliptic-curve scalar multiplication algorithm using ZOT structure
The computation of P over elliptic curves is the dominant operation. It depends on the representation of the scalar . The binary method is the standard unsigned method that is used to compute the elliptic curve point . Researchers found that it is not the most efficient way for implementing elliptic curve computations. Other recoding methods such as CR, NAF, and MOF were presented in order to e...
متن کاملElliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases
In this paper we propose to take one step back in the use of double base number systems for elliptic curve point scalar multiplication. Using a modified version of Yao’s algorithm, we go back from the popular double base chain representation to a more general double base system. Instead of representing an integer k as Pn i=1 2 i3i where (bi) and (ti) are two decreasing sequences, we only set a ...
متن کاملEfficient Elliptic Curve Point Multiplication with Montgomery Ladder Algorithm
Scalar point multiplication has encountered significant attention in Elliptic curve cryptography (ECC) which is gaining popularity due to providing same level security with smaller key sizes compared to traditional cryptosystems, such as Ron Rivest, Adi Shamir, and Leonard Adleman (RSA). Point multiplication (KP) in ECC is basically performed on point addition and point doubling on elliptic cur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ECTI Transactions on Computer and Information Technology (ECTI-CIT)
سال: 1970
ISSN: 2286-9131,2286-9131
DOI: 10.37936/ecti-cit.200511.51824